Random walk attachment graphs

Random walk attachment graphs

We consider the random walk attachment graph introduced by Saramäki and Kaski and proposed as a mechanism to explain how behaviour similar to preferential attachment may appear requiring only local knowledge. We show that if the length of the random walk is fixed then the resulting graphs can have properties significantly different from those of preferential attachment graphs, and in particular...

A “Random Walk” through Prepositional Phrase Attachment

This document surveys the field of research in preposition phrase attachment resolution, looking back at the way the problem was approached in the 1990s, as well as at modern techniques for resolving this basic syntactic ambiguity problem. Techniques are described and compared, and their effectiveness is considered.

Nongrowing Preferential Attachment Random Graphs

We consider an edge rewiring process which is widely used to model the dynamics of scale-free weblike networks. This process uses preferential attachment and operates on sparse multigraphs with n vertices and m edges. We prove that its mixing time is optimal and develop a framework which simplifies the calculation of graph properties in the steady state. The applicability of this framework is d...

Vertex-Reinforced Random Walk on Arbitrary Graphs

Random Walk on Directed Dynamic Graphs

Dynamic graphs have emerged as an appropriate model to capture the changing nature of many modern networks, such as peer-to-peer overlays and mobile ad hoc networks. Most of the recent research on dynamic networks has only addressed the undirected dynamic graph model. However, realistic networks such as the ones identified above are directed. In this paper we present early work in addressing th...